#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;

int gcd(int n, int m)
{
	if (n % m == 0) {
		return m;
	}
	else {
		return gcd(m, n % m);
	}
}
long long fun(int n, int m)
{
	if (n < m) {
		swap(n, m);
	}
	int temp = 0;
	while (m) {
		temp = n % m;
		n = m;
		m = temp;
	}
	return n;
}
int main()
{
	long long a, b, c;
	cin >> a >> b >> c;
	long long mi = a;
	long long ma = a;
	mi = min(mi, b);
	mi = min(mi, c);
	ma = max(ma, b);
	ma = max(ma, c);
	long long  ret = fun(mi, ma);
	//cout << ret << endl;
	long long  temp1 = mi / ret;
	long long  temp2 = ma / ret;
	cout << temp1 << "/" << temp2 << endl;
	return 0;
}